Adjacency-Preserving Spatial Treemaps
نویسندگان
چکیده
Abstract. Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political regions. A spatial treemap is a rectangular layout with a hierarchical structure: the outer rectangle is subdivided into rectangles that are in turn subdivided into smaller rectangles. We describe algorithms for transforming a rectangular layout that does not have this hierarchical structure, together with a clustering of the rectangles of the layout, into a spatial treemap that respects the clustering and also respects to the extent possible the adjacencies of the input layout.
منابع مشابه
The machine learning process in applying spatial relations of residential plans based on samples and adjacency matrix
The current world is moving towards the development of hardware or software presence of artificial intelligence in all fields of human work, and architecture is no exception. Now this research seeks to present a theoretical and practical model of intuitive design intelligence that shows the problem of learning layout and spatial relationships to artificial intelligence algorithms; Therefore, th...
متن کاملDiscovery Exhibition: Using Spatial Treemaps in Local Authority Decision Making and Reporting
At Leicestershire County Council we are using spatial treemaps to analyse labour markets and commuting behaviour. This novel visualization technique, presented at InfoVis 2008, has resulted in a number of insights and discoveries. Transport planners in our organization indicate that the graphics are effective and have advantages over alternatives. As researchers in the local authority we report...
متن کاملClockMap: Enhancing Circular Treemaps with Temporal Glyphs for Time-Series Data
Treemaps are a powerful method to visualize especially time-invariant hierarchical data. Most attention is drawn to rectangular treemaps, because their space-filling layouts provide good scalability with respect to the amount of data that can be displayed. Since circular treemaps sacrifice the space-filling property and since higher level circles only approximately match the aggregated size of ...
متن کاملAdjacency preserving mappings
In a certain class of point-line geometries, called locally projective near polygons, which includes dual polar spaces and generalised 2n-gons, surjective adjacency preserving mappings are already collineations.
متن کاملAdjacency Preserving Mappings of Rectangular Matrices
Let D be a division ring and let m,n be integers ≥ 2. Let Mm×n(D) be the space of m × n matrices. In the fundamental theorem of the geometry of rectangular matrices all bijective mappings φ of Mm×n(D) are determined such that both φ and φ−1 preserve adjacency. We show that if a bijective map φ of Mm×n(D) preserves the adjacency then also φ −1 preserves the adjacency. Thus the supposition that φ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JoCG
دوره 7 شماره
صفحات -
تاریخ انتشار 2011